CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗†

Source URL: www.cccg.ca

• Largest empty rectangle
• Algorithm
• Closest pair of points problem
• Reduction
• Computer science
• Computational geometry
• Beta skeleton
• Mathematics
• Applied mathematics
• Computational complexity theory

Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane Stefan Schirra∗ this problem, we are given a set S of n (weighted) points and we are looking for a ra

Source URL: www.cccg.ca

• Bitangent
• Algebraic geometry
• Rational point
• P2X purinoreceptor
• Envelope
• Differential geometry
• Biology
• Algebraic curves

On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

Source URL: arxiv.org

• NP-complete problems
• Exponential time hypothesis
• Conjunctive normal form
• Boolean satisfiability problem
• Vertex cover
• Set cover problem
• Time complexity
• Graph coloring
• Independent set
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Problem Set Some of the problems are taken from the book B.F. Schutz, ”A first course in General Relativity” (Cambridge University Press, The three fundamental constants of Nature: c, h ¯ and G set a uniqu

Source URL: www.nordita.org

• Physical cosmology
• General relativity
• Theories of gravitation
• Friedmann–Lemaître–Robertson–Walker metric
• Cosmological constant
• Physical quantity
• Metric tensor
• Rindler coordinates
• Symbol
• Physics
• Theoretical physics
• Exact solutions in general relativity

Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1

Source URL: www.cs.technion.ac.il

• NP-complete problems
• Vertex cover
• Tree decomposition
• Graph
• Voltage graph
• Dominating set
• Graph theory
• Theoretical computer science
• Mathematics

Using Answer Set Programming to model multi-agent scenarios involving agents’ knowledge about other’s knowledge Chitta Baral, Gregory Gelfond Tran Cao Son, Enrico Pontelli

Source URL: myweb.ttu.edu

• Modal logic
• Artificial intelligence
• Knowledge representation
• Kripke semantics
• Frame problem
• Entailment
• Epistemic modal logic
• Common knowledge
• Stable model semantics
• Logic
• Philosophical logic
• Logic programming

Problem set: solar irradiance and solar wind Karel Schrijver July 13, 2013 1

Source URL: www.heliophysics.ucar.edu

• Plasma physics
• Physical quantities
• Sun
• Corona
• Sunspot
• Star
• Solar wind
• Magnetic braking
• Magnetic field
• Physics
• Space plasmas
• Light sources

Astro 242: Problem Set 6 1 Problem 1: Conformal Time and Horizons • Assume the universe today is flat with both matter (Ωm ) and a cosmological constant (ΩΛ ). (a) Compute

Source URL: background.uchicago.edu

URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing

Source URL: www.mrfellows.net

• NP-complete problems
• Analysis of algorithms
• Complexity classes
• Parameterized complexity
• Dominating set
• Kernelization
• Vertex cover
• Clique problem
• NP-complete
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng†

Source URL: www.cccg.ca

• NP-complete problems
• Complexity classes
• Approximation algorithms
• Operations research
• Set cover problem
• Polynomial-time approximation scheme
• Time complexity
• Linear programming relaxation
• NP
• Theoretical computer science
• Computational complexity theory
• Applied mathematics